A generalization of the Shapley-Ichiishi result
نویسندگان
چکیده
The Shapley-Ichiishi result states that a game is convex if and only if the convex hull of marginal vectors equals the core. In this paper we generalize this result by distinguishing equivalence classes of balanced games that share the same core structure. We then associate a system of linear inequalities with each equivalence class, and we show that the system defines the class. Application of this general theorem to the class of convex games yields an alternative proof of the Shapley-Ichiishi result. Other applications range from computation of stable sets in non-cooperative game theory to determination of classes of TU games on which the core correspondence is additive (even linear). For the case of convex games we prove that the theorem provides the minimal defining system of linear inequalities. An example shows that this is not necessarily true for other equivalence classes of balanced games. SSE/EFI Working Paper Series in Economics and Finance, No. 711. MICC-Mathematics, Maastricht University, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Department of Quantitative Economics, Maastricht University, P.O.Box 616, 6200 MD Maastricht, The Netherlands. Department of Economics, Stockholm School of Economics, P.O.Box 6501, 113 83 Stockholm, Sweden. Financial support from the Wallander/Hedelius Foundation is gratefully acknowledged. We thank two anonymous referees and William Thomson for their helpful comments on earlier drafts of this paper and Jean Derks for many fruitful discussions.
منابع مشابه
Generalized Convex Games
Economists have long argued that the existence of increasing returns to scale or unique complementary inputs may lead to indeterminacy in how the gains to team production are shared among team members. Cooperative games provide a framework in which to formalize and explore this intuition. In games with side payments, the notion of a convex game introduced by Shapley (1971) provides a natural wa...
متن کاملAlternative Axiomatic Characterizations of the Grey Shapley Value
The Shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. Certainly, the Shapley value can be used in interesting sharing cost/reward problems in the Operations Research area such as connection, routing, scheduling, production and inventory situations. In this paper, we focus on the Shapl...
متن کاملAn algorithm for finding the vertices of the k-additive monotone core
Given a capacity, the set of dominating k-additive capacities is a convex polytope called the k-additive monotone core; thus, it is defined by its vertices. In this paper we deal with the problem of deriving a procedure to obtain such vertices in the line of the results of Shapley and Ichiishi for the additive case. We propose an algorithm to determine the vertices of the n-additive monotone co...
متن کاملOn Vertices of the k-Additive Monotone Core
Given a capacity, the set of dominating k-additive capacities is a convex polytope; thus, it is defined by its vertices. In this paper we deal with the problem of deriving a procedure to obtain such vertices in the line of the results of Shapley and Ichiishi for the additive case. We propose an algorithm to determine the vertices of the k-additive monotone core. Then, we characterize the vertic...
متن کاملA generalization of Villarreal's result for unmixed tripartite graphs
In this paper we give a characterization of unmixed tripartite graphs under certain conditions which is a generalization of a result of Villarreal on bipartite graphs. For bipartite graphs two different characterizations were given by Ravindra and Villarreal. We show that these two characterizations imply each other.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Game Theory
دوره 39 شماره
صفحات -
تاریخ انتشار 2010